Degree sum conditions for hamiltonian index
نویسندگان
چکیده
Abstract In this note, we show a sharp lower bound of $$\min \left\{{\sum\nolimits_{i = 1}^k {{d_G}({u_i}):{u_1}{u_2} \ldots {u_k}}} \right.$$ min { ∑ i = 1 k d G ( u ) : 2 … is path (2-)connected G on its order such that ( k -1)-iterated line graphs L −1 ) are hamiltonian.
منابع مشابه
Improved degree conditions for Hamiltonian properties
In 1980, Bondy proved that for an integer k ≥ 2 a (k+ s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least 1 2 ((k+1)(n+ s−1)+1). This generalizes the well-known sufficient conditions of Dirac (k = 0) and Ore (k = 1). The condition in Bondy’s Theorem is not ...
متن کاملDegree conditions for k-ordered hamiltonian graphs
For a positive integer k, a graph G is k-ordered hamiltonian if for every ordered sequence of k vertices there is a hamiltonian cycle that encounters the vertices of the sequence in the given order. It is shown that if G is a graph of order n with 3 k n /2, and deg(u)þ deg(v ) nþ (3k 9)/2 for every pair u; v of nonadjacent vertices of G, then G is k-ordered hamiltonian. Minimum degree condition...
متن کاملDegree sum conditions in graph pebbling
Given a graph G on n vertices and a distribution, D, of pebbles on the vertices of G, we define a pebbling move to be the removal of two pebbles from a given vertex and the placement of one on an adjacent vertex. If D has n pebbles and if after a sequence of pebbling moves we can place a pebble on any specified vertex then we call G Class 0. We give a sufficient degree sum condition for G to be...
متن کاملSpanning 2-trails from degree sum conditions
Suppose G is a simple connected n-vertex graph. Let σ3(G) denote the minimum degree sum of three independent vertices in G (which is ∞ ifG has no set of three independent vertices). A 2-trail is a trail that uses every vertex at most twice. Spanning 2-trails generalize hamilton paths and cycles. We prove three main results. First, if σ3(G) ≥ n−1, then G has a spanning 2-trail, unless G ∼= K1,3....
متن کاملDegree sum conditions and vertex-disjoint cycles in a graph
We consider degree sum conditions and the existence of vertex-disjoint cycles in a graph. In this paper, we prove the following: Suppose that G is a graph of order at least 3k + 2 and σ3(G) ≥ 6k − 2, where k ≥ 2. Then G contains k vertex-disjoint cycles. The degree and order conditions are sharp.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics-a Journal of Chinese Universities Series B
سال: 2021
ISSN: ['1005-1031', '1993-0445', '1000-4424']
DOI: https://doi.org/10.1007/s11766-021-3885-4